Incremental Refinement of Success Patterns of Logic Programs
نویسنده
چکیده
We propose a method for incrementally computing success patterns of logic programs with respect to a class of abstractions. The method is specialised for computing success patterns for depth and stump abstractions. Equational unification algorithms for these abstractions are presented.
منابع مشابه
Incremental Computation of Success Patterns of Logic Programs
ions, that the set of success patterns of a logic program P with respect to an abstraction α is tantamount to the success set of the equational logic program where Eα is an equality theory induced by α. Therefore, either the fixpoint semantics or the procedural semantics defined for equational logic programs can be used to compute success patterns of logic programs. From this observation, the s...
متن کاملGrain Refinement Efficiency of Multi-Axial Incremental Forging and Shearing: A Crystal Plasticity Analysis
Severe plastic deformation is a technical method to produce functional material with special properties such as high strength and specific physical properties. Selection of an efficient severe plastic deformation for grain refinement is a challenging field of study and using a modeling technique to predict the refinement efficiency has gained a lot of attentions. A comparative study was carried...
متن کاملApproximating Predicate Images for Bit-Vector Logic
Predicate abstraction refinement is a successful technique for verifying large ANSI-C programs. However, computing the image of the predicates with respect to the transition relation is computationally expensive. Recent results have shown that predicate images can be computed by transforming a proof of a formula over integers into a Boolean formula that is satisfiable if and only if the origina...
متن کاملPOPL: G: Refinement Types for Incremental Computational Complexity
With recent advances, programs can be compiled to efficiently respond to incremental input changes. However, there is no language-level support for reasoning about the time complexity of incremental updates. Motivated by this gap, we present CostIt, a higher-order functional language with a lightweight refinement type system for proving asymptotic bounds on incremental computation time. Type re...
متن کاملDeveloping Logic Programs from Specifications Using Stepwise Refinement
In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introductio...
متن کامل